Routing permutations in Partitioned Optical Passive Stars Networks

Routing permutations in Partitioned Optical Passive Stars Networks

It is shown that a Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can route any permutation among the n = dg processors in one slot when d = 1 and 2dd=ge slots when d > 1. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations π such that π(i) 6= i, for all i.

Routing Permutations in Partitioned Optical Passive Star Networks

It is shown that a Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can route any permutation among the n = dg processors in one slot when d = 1 and 2⌈d/g⌉ slots when d > 1. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations π such that π(i) = i, for all i.

The Partitioned Optical Passive Stars (POPS) topology

This paper presents and analyzes a topological approach to providing multiple data channels using current technologies. The Partitioned Optical Passive Stars (POPS) topology is an all-optical interconnec-tion architecture that uses multiple non-hierarchical couplers. POPS topologies provide powerful conng-urability for optimization of system complexity, network throughput, power budget, and con...

Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network

The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations